Computable News Ecosystems: Roles for Humans and Machines

نویسنده

  • David Caswell
چکیده

Two contrasting paradigms for structuring news events and storylines are identified and described: the automated paradigm and the manual paradigm. A specific manual news structuring system is described, and the highlevel results of three reporting experiments conducted using the system are presented. In light of these results I then compare automated and manual approaches and argue that they are complementary. A proposal for integrating automated and manual techniques within a structured news ecosystem is presented, and recommendations for integrated approaches are provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On computable abstractions (a conceptual introduction)

Machines operationally equivalent to a Turing machine have fundamental limitations that prevent them from yielding results that are comparable to the results produced by humans when performing intellectual tasks (e.g., processing of natural language, visual object recognition, derivation of the whole of mathematics from first principles). For instance, while these machines can cover only a subs...

متن کامل

On Computable Numbers, with an Application to the Entscheidungsproblem

1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated tables Further examples. 5. Enumeration of computable sequences. 6. The universal computing machine. 7. Detailed description of the universal machine. 8. Application of the diagonal process. Pagina 1 di...

متن کامل

Costs of General Purpose Learning

Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc-identification). His machine, on the successive graph points of f , outputs a corresponding infinite sequence of programs p0, p1, p2, . . ., and, for some i, the programs pi, pi+1, pi+2, . . . each compute a variant of f which differs from f at only finitel...

متن کامل

Crowdsourcing Salient Information from Tweets and News

The increasing streams of information pose challenges to both humans and machines. On the one hand, humans need to identify relevant information and consume only the information that lies at their interests. On the other hand, machines need to understand the information that is published in online data streams and generate concise and meaningful overviews. We consider events as prime factors to...

متن کامل

Process and truth-table characterisations of randomness

This paper uses quick process machines to provide characterisations of computable randomness, Schnorr randomness and weak randomness. The quick process machine is a type of process machine first considered in work of Levin and Zvonkin. A new technique for building process machines and quick process machines is presented. This technique is similar to the KC theorem for prefix-free machines. Usin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016